Domino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds

Domino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds

We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...

On Domino Tilings of Rectangles Aztec Diamonds in the Rough

Aztec Diamonds and Baxter Permutations

Abstract We present a proof of a conjecture about the relationship between Baxter permutations and pairs of alternating sign matrices that are produced from domino tilings of Aztec diamonds. It is shown that a tiling corresponds to a pair of ASMs that are both permutation matrices if and only if the larger permutation matrix corresponds to a Baxter permutation. There has been a thriving literat...

Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations∗

In 1992 Elkies, Kuperberg, Larsen, and Propp introduced a bijection between domino tilings of Aztec diamonds and certain pairs of alternating-sign matrices whose sizes differ by one. In this paper we first study those smaller permutations which, when viewed as matrices, are paired with the matrices for doubly alternating Baxter permutations. We call these permutations snow ∗2010 AMS Subject Cla...

A Note on Domino Shuffling

We present a variation of James Propp’s generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient co...